Polynomial Time Approximation Schemes for All 1-Center Problems on Metric Rational Set Similarities

In this paper, we investigate algorithms for finding centers of a given collection $$\mathcal N$$ sets. particular, focus on metric rational set similarities, broad class similarity measures including Jaccard and Hamming. A S is called if $$D=1-S$$ distance function. We study the 1-center problem these spaces. The consists C that minimizes maximum to any . present general framework computes $$(1+\varepsilon )$$ approximation similarity.